A branch-and-cut algorithm for the ring spur assignment problem
نویسندگان
چکیده
منابع مشابه
Investigation of the Ring Spur Assignment Problem
This paper describes the Ring Spur Assignment Problem (RSAP), an interesting new problem arising in the design of Next Generation Networks. We describe the problem, position it in relation to problems previously addressed in the literature and give an IP model suitable for solving small problem instances. We outline a cutting plane algorithm for larger problem instances and present some computa...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA column generation and branch-and-cut algorithm for the channel assignment problem
Department of Electrical Engineering, École Polytechnique de Montréal, P.O. Box 6079, Station Centre-ville, Montreal (Quebec) Canada, H3C 3A7 CRC Chair on the Optimization of Communication Networks, Department of Computer Science and Operations Research, Université de Montréal, P.O. Box 6128, Station Centre-ville, Montreal (Quebec) Canada, H3C 3J7 Department of Computer Science, Université du Q...
متن کاملA branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem
This paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and multiple separation heuristics are presented. In our numerical experiments the branch-and-cut algorithm is 3.8 times...
متن کاملA branch-and-cut algorithm for the preemptive swapping problem
In the Swapping Problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determining a minimum cost route that allows the vehicle to satisfy every supply and demand. This article investigates t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2013
ISSN: 0028-3045
DOI: 10.1002/net.21495